Explicit Substitutions for Objects and Functions
نویسندگان
چکیده
This paper proposes an implementation of objects and functions via a calculus with explicit substitutions which is connuent and preserves strong normal-ization. The source calculus corresponds to the combination of the &-calculus of Abadi and Cardelli AC96] and the-calculus, and the target calculus corresponds to an extension of the former calculus with explicit substitutions. The interesting feature of our calculus is that substitutions are separated { and treated accordingly { in two diierent kinds: those used to encode ordinary substitutions and those encoding invoke substitutions. When working with explicit substitutions, this diierentiation is essential to encode-calculus into &-calculus in a conservative way, following the style proposed in AC96].
منابع مشابه
Dependent Types and Explicit Substitutions
We present a dependent-type system for a λ-calculus with explicit substitutions. In this system, meta-variables, as well as substitutions, are first-class objects. We show that the system enjoys properties like type uniqueness, subject reduction, soundness, confluence and weak normalization.
متن کاملFunctional Programming With Higher-order Abstract Syntax and Explicit Substitutions
This paper sketches a foundation for programming with higher-order abstract syntax and explicit substitutions based on contextual modal type theory [NPP05]. Contextual modal types not only allows us to cleanly separate the representation of data objects from computation, but allow us to recurse over data objects with free variables. In this paper, we extend these ideas even further by adding fi...
متن کاملComprehensive Simulation for Two-diode Model of Photovoltaic Cells in SimPowerSystems Using Explicit Mathematical Functions
In this paper, using Thevenin’s theorem and also nonlinear Lambert W function, a novel two-diode model of photovoltaic cells is presented in mathematical explicit manner. In comparison with existing explicit models in the literature which are valid exclusively for n2=n1 and n2=2n1, this model includes a wide range of silicon-based cells with arbitrary diodes ideality factors. Acquiring regulati...
متن کاملLinear lambda calculus with explicit substitutions as proof-search in Deep Inference
SBV is a deep inference system that extends the set of logical operators of multiplicative linear logic with the non commutative operator seq. We introduce the logical system SBVrwhich extends SBV by adding a self-dual atom-renaming operator to it. We prove that the cut elimination holds on SBVr. SBVr and its cut free subsystem BVr are complete and sound with respect to linear Lambda calculus w...
متن کاملA Novel Method for Tracking Moving Objects using Block-Based Similarity
Extracting and tracking active objects are two major issues in surveillance and monitoring applications such as nuclear reactors, mine security, and traffic controllers. In this paper, a block-based similarity algorithm is proposed in order to detect and track objects in the successive frames. We define similarity and cost functions based on the features of the blocks, leading to less computati...
متن کامل